Computer‐sorting procedure for inverting functions
نویسندگان
چکیده
منابع مشابه
On Inverting Onto Functions
We study the complexity of inverting many-one, honest, polynomial-time computable onto functions. Asserting that every polynomial-time computable, honest, onto function is invertible is equivalent to the following proposition that we call Q: For all NP machines M that accept , there exists a polynomial-time computable function gM such that for all x, gM(x) outputs an accepting computation of M ...
متن کاملInverting Functions as Folds
This paper is devoted to the proof and applications of a theorem giving conditions under which the inverse of a partial function can be expressed as a relational hylomorphism. The theorem is a generalisation of a previous result, due to Bird and de Moor, that gave conditions under which a total function can be expressed a relational fold. The theorem is illustrated with three problems, all deal...
متن کاملInverting random functions
In this paper we study how to invert random functions under different criteria. The motivation for this study is phylogeny reconstruction, since the evolution of biomolecular sequences may be considered as a random function from the set of possible phylogenetic trees to the set of collections of biomolecular sequences of observed species. Our results may effect how we think about the maximum li...
متن کاملInverting Onto Functions
We look at the hypothesis that all honest onto polynomial-time computable functions have a polynomial-time computable inverse. We show this hypothesis equivalent to several other complexity conjectures including • In polynomial time, one can find accepting paths of nondeterministic polynomialtime Turing machines that accept Σ∗. • Every total multivalued nondeterministic function has a polynomia...
متن کاملInverting Random Functions III: Discrete MLE Revisited∗
This paper continues our earlier investigations into the inversion of random functions in a general (abstract) setting. In Section 2, we investigate a concept of invertibility and the invertibility of the composition of random functions defined on finite sets. In Section 3, we resolve some questions concerning the number of samples required to ensure the accuracy of maximum likelihood estimatio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of the Acoustical Society of America
سال: 1976
ISSN: 0001-4966
DOI: 10.1121/1.2003526